1944C - MEX Game 1 - CodeForces Solution


constructive algorithms games greedy

Please click on ads to support us..

Python Code:

t = int(input())
while t > 0:
    n = int(input())
    arr = list(map(int, input().split()))
    
    x = 0
    from collections import Counter
    c = Counter(arr)
    for i in range(0, n+1):
        if c.get(i, 0) == 0:
            print(i)
            break
        if c.get(i) == 1:
            x += 1
        if x == 2:
            print(i)
            break
    t -= 1


Comments

Submit
0 Comments
More Questions

1401C - Mere Array
1613B - Absent Remainder
1536B - Prinzessin der Verurteilung
1699B - Almost Ternary Matrix
1545A - AquaMoon and Strange Sort
538B - Quasi Binary
424A - Squats
1703A - YES or YES
494A - Treasure
48B - Land Lot
835A - Key races
1622C - Set or Decrease
1682A - Palindromic Indices
903C - Boxes Packing
887A - Div 64
755B - PolandBall and Game
808B - Average Sleep Time
1515E - Phoenix and Computers
1552B - Running for Gold
994A - Fingerprints
1221C - Perfect Team
1709C - Recover an RBS
378A - Playing with Dice
248B - Chilly Willy
1709B - Also Try Minecraft
1418A - Buying Torches
131C - The World is a Theatre
1696A - NIT orz
1178D - Prime Graph
1711D - Rain